A tighter lower bound on the circuit size of the hardest Boolean functions
نویسنده
چکیده
In [IPL2005], Frandsen and Miltersen improved bounds on the circuit size L(n) of the hardest Boolean function on n input bits: for some constant c > 0: ( 1 + log n n − c n ) 2 n ≤ L(n) ≤ ( 1 + 3 logn n + c n ) 2 n . In this note, we announce a modest improvement on the lower bound: for some constant c > 0 (and for any sufficiently large n), L(n) ≥ ( 1 + 2 log n n − c n ) 2 n .
منابع مشابه
Reviewing bounds on the circuit size of the hardest functions
In this paper we review the known bounds for L(n), the circuit size complexity of the hardest Boolean function on n input bits. The best known bounds appear to be 2 n (1 + log n n −O( 1 n )) ≤ L(n) ≤ 2 n n (1 + 3 log n n + O( 1 n )) However, the bounds do not seem to be explicitly stated in the literature. We give a simple direct elementary proof of the lower bound valid for the full binary bas...
متن کاملA 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function
We give a simple proof of a 5n − o(n) lower bound on the circuit size over U2 of a linear function f(x) = Ax where A ∈ {0, 1}logn×n (here, U2 is the set of all Boolean binary functions except for parity and its complement).
متن کاملA 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions
Consider the combinational complexity L(f) of Boolean functions over the basis fl={]'l]': {0, 1}2->{0, 1}}. A new method for proving linear lower bounds of size 2n is presented. we establish for a special sequence of functions [: {0, 1} "+2 g(n)+x-> {0, 1}: 2.5n <=L(f)<-6n. Also a trade-off result between circuit complexity and formula size is derived. 1. Introduction. The interest in lower bou...
متن کاملA Lower Bound for Boolean Permanent in Bijective Boolean Circuits and its Consequences
We identify a new restriction on Boolean circuits called bijectivity and prove that bijective Boolean circuits require exponential size to compute the Boolean permanent function. As consequences of this lower bound, we show exponential size lower bounds for: (a) computing the Boolean permanent using monotone multilinear circuits ; (b) computing the 0-1 permanent function using monotone arithmet...
متن کاملA Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds
A Boolean function on n variables is called k-mixed if for any two different restrictions fixing the same set of k variables must induce different functions on the remaining n−k variables. In this paper, we give an explicit construction of an n − o(n)-mixed Boolean function whose circuit complexity over the basis U2 is 5n + o(n). This shows that a lower bound method on the size of a U2-circuit ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 18 شماره
صفحات -
تاریخ انتشار 2011